On the Compared Expressiveness of Arc, Place and Transition Time Petri Nets
نویسندگان
چکیده
In this paper, we consider safe Time Petri Nets where time intervals (strict and large) are associated with places (P-TPN), arcs (A-TPN) or transitions (T-TPN). We give the formal strong and weak semantics of these models in terms of Timed Transition Systems. We compare the expressiveness of the six models w.r.t. (weak) timed bisimilarity (behavioral semantics). The main results of the paper are : (i) with strong semantics, A-TPN is strictly more expressive than P-TPN and T-TPN ; (ii) with strong semantics P-TPN and T-TPN are incomparable ; (iii) T-TPN with strong semantics and T-TPN with weak semantics are incomparable. Moreover, we give a complete classification by a set of 9 relations explained in Fig. 19 (p. 23).
منابع مشابه
Comparison of the expressiveness w.r.t. timed bisimilarity of k-bounded Arc, Place and Transition Time Petri Nets with weak and strong single server semantics
In this paper, we consider bounded Time Petri Nets where time intervals (strict and large) are associated with places (P-TPN), arcs (A-TPN) or transitions (T-TPN). We give the formal strong and weak semantics of these models in terms of Timed Transition Systems. We compare the expressiveness of the six models w.r.t. (weak) timed bisimilarity (behavioral semantics). The main results of the paper...
متن کاملA Formal Petri Net Based Model for Antivirus Update Agent System
In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...
متن کاملA Formal Petri Net Based Model for Antivirus Update Agent System
In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...
متن کاملHigh-Level Petri Nets as Type Theories in the Join Calculus
We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four classes of nets of increasing expressiveness, Πi, introduce a hierarchy of type systems of decreasing strictness, ∆i, i = 0, . . . , 3, and we prove that a join process is typeable according to ∆i if and only if it is (strictly...
متن کاملReduction rules for reset/inhibitor nets
Reset/inhibitor nets are Petri nets extended with reset arcs and inhibitor arcs. These extensions can be used to model cancelation and blocking. A reset arc allows a transition to remove all tokens from a certain place when the transition fires. An inhibitor arc can stop a transition from being enabled if the place contains one or more tokens. While reset/inhibitor nets increase the expressive ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 88 شماره
صفحات -
تاریخ انتشار 2008